Considering inter-task resource constraints in task allocation
نویسندگان
چکیده
منابع مشابه
Integrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملEfficient Inter-Team Task Allocation in RoboCup Rescue
The coordination of cooperative agents involved in rescue missions is an important open research problem. We consider the RoboCup Rescue Simulation (RCS) challenge, where teams of agents perform urban rescue operations. Previous approaches typically cast such problem as separate single-team allocation problems. However, different teams have complementary capabilities, and therefore some kind of...
متن کاملA GA Based Multiple Task Allocation Considering Load
A Distributed Computing System (DCS) comprising networked heterogeneous processors requires efficient tasks to processor allocation to achieve minimum turnaround time and highest possible throughput. Task allocation in DCS remains an important and relevant problem attracting the attention of researchers in the discipline. A good number of task allocation algorithms have been proposed in the lit...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملTask allocation in volunteer computing networks under monetary budget constraints
In volunteer computing networks, the peers contribute to the solution of a computationally intensive problem by freely providing their computational resources, i.e., without seeking any immediate financial benefit. In such networks, although the peers can set certain bounds on how much their resources can be exploited by the network, the monetary cost that the network brings to the peers is unc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Autonomous Agents and Multi-Agent Systems
سال: 2012
ISSN: 1387-2532,1573-7454
DOI: 10.1007/s10458-012-9196-7